InforLorV4, Main, Exploration, bibRecord, 008748

SCIL — Symbolic Constraints in Integer Linear Programming

Identifieur interne : 008748 ( Main/Exploration ); précédent : 008747; suivant : 008749

SCIL — Symbolic Constraints in Integer Linear Programming

Auteurs : Ernst Althaus [États-Unis] ; Alexander Bockmayr [France] ; Matthias Elf [Allemagne] ; Michael Jünger [Allemagne] ; Thomas Kasper [Allemagne] ; Kurt Mehlhorn [Allemagne]

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:1DADC9ED7085286A646062DB162C7B948D720E64

Descripteurs français

Pascal (Inist)
- Logiciel exploitation, Méthode séparation et évaluation, Optimisation combinatoire, Programmation en nombres entiers, Programmation linéaire, Ramification.

English descriptors

KwdEn :
- Branch and bound method, Branching, Combinatorial optimization, Integer programming, Linear programming, Systems software.

Abstract

Abstract: We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi.cantly to the expressive power, ease of use, and e.ciency of constraint programming systems.

Url:

https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/fulltext.pdf

DOI: 10.1007/3-540-45749-6_11

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">SCIL — Symbolic Constraints in Integer Linear Programming</title>
<author><name sortKey="Althaus, Ernst" sort="Althaus, Ernst" uniqKey="Althaus E" first="Ernst" last="Althaus">Ernst Althaus</name>
</author>
<author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name>
</author>
<author><name sortKey="Elf, Matthias" sort="Elf, Matthias" uniqKey="Elf M" first="Matthias" last="Elf">Matthias Elf</name>
</author>
<author><name sortKey="Junger, Michael" sort="Junger, Michael" uniqKey="Junger M" first="Michael" last="Jünger">Michael Jünger</name>
</author>
<author><name sortKey="Kasper, Thomas" sort="Kasper, Thomas" uniqKey="Kasper T" first="Thomas" last="Kasper">Thomas Kasper</name>
</author>
<author><name sortKey="Mehlhorn, Kurt" sort="Mehlhorn, Kurt" uniqKey="Mehlhorn K" first="Kurt" last="Mehlhorn">Kurt Mehlhorn</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:1DADC9ED7085286A646062DB162C7B948D720E64</idno>
<date when="2002" year="2002">2002</date>
<idno type="doi">10.1007/3-540-45749-6_11</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000676</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000676</idno>
<idno type="wicri:Area/Istex/Curation">000671</idno>
<idno type="wicri:Area/Istex/Checkpoint">001B84</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001B84</idno>
<idno type="wicri:doubleKey">0302-9743:2002:Althaus E:scil:symbolic:constraints</idno>
<idno type="wicri:Area/Main/Merge">008C04</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:03-0222943</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000805</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000238</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000774</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000774</idno>
<idno type="wicri:doubleKey">0302-9743:2002:Althaus E:scil:symbolic:constraints</idno>
<idno type="wicri:Area/Main/Merge">008D59</idno>
<idno type="wicri:Area/Main/Curation">008748</idno>
<idno type="wicri:Area/Main/Exploration">008748</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">SCIL — Symbolic Constraints in Integer Linear Programming</title>
<author><name sortKey="Althaus, Ernst" sort="Althaus, Ernst" uniqKey="Althaus E" first="Ernst" last="Althaus">Ernst Althaus</name>
<affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>International Computer Science Institute, 1947 Center St., Suite 600, 94704-1198, Berkeley, CA</wicri:regionArea>
<placeName><region type="state">Californie</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name>
<affiliation wicri:level="4"><country xml:lang="fr">France</country>
<wicri:regionArea>LORIA, Université Henri Poincaré, B.P. 239, F-54506, Vand-uvre-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vand-uvre-lès-Nancy</settlement>
</placeName>
<orgName type="university">Université Henri Poincaré</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Elf, Matthias" sort="Elf, Matthias" uniqKey="Elf M" first="Matthias" last="Elf">Matthias Elf</name>
<affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln</wicri:regionArea>
<placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region>
<region type="district" nuts="2">District de Cologne</region>
<settlement type="city">Cologne</settlement>
</placeName>
<orgName type="university">Université de Cologne</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Junger, Michael" sort="Junger, Michael" uniqKey="Junger M" first="Michael" last="Jünger">Michael Jünger</name>
<affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln</wicri:regionArea>
<placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region>
<region type="district" nuts="2">District de Cologne</region>
<settlement type="city">Cologne</settlement>
</placeName>
<orgName type="university">Université de Cologne</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Kasper, Thomas" sort="Kasper, Thomas" uniqKey="Kasper T" first="Thomas" last="Kasper">Thomas Kasper</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>SAP AG, GBU Supply Chain Management, Neurottstraße 16, 69189, Walldorf</wicri:regionArea>
<wicri:noRegion>69189, Walldorf</wicri:noRegion>
<wicri:noRegion>Walldorf</wicri:noRegion>
</affiliation>
<affiliation></affiliation>
</author>
<author><name sortKey="Mehlhorn, Kurt" sort="Mehlhorn, Kurt" uniqKey="Mehlhorn K" first="Kurt" last="Mehlhorn">Kurt Mehlhorn</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Max-Planck-Institute für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken</wicri:regionArea>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Branch and bound method</term>
<term>Branching</term>
<term>Combinatorial optimization</term>
<term>Integer programming</term>
<term>Linear programming</term>
<term>Systems software</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Logiciel exploitation</term>
<term>Méthode séparation et évaluation</term>
<term>Optimisation combinatoire</term>
<term>Programmation en nombres entiers</term>
<term>Programmation linéaire</term>
<term>Ramification</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi.cantly to the expressive power, ease of use, and e.ciency of constraint programming systems.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
<li>France</li>
<li>États-Unis</li>
</country>
<region><li>Californie</li>
<li>District de Cologne</li>
<li>Grand Est</li>
<li>Lorraine (région)</li>
<li>Rhénanie-du-Nord-Westphalie</li>
<li>Sarre (Land)</li>
</region>
<settlement><li>Cologne</li>
<li>Sarrebruck</li>
<li>Vand-uvre-lès-Nancy</li>
</settlement>
<orgName><li>Université Henri Poincaré</li>
<li>Université de Cologne</li>
</orgName>
</list>
<tree><country name="États-Unis"><region name="Californie"><name sortKey="Althaus, Ernst" sort="Althaus, Ernst" uniqKey="Althaus E" first="Ernst" last="Althaus">Ernst Althaus</name>
</region>
<name sortKey="Althaus, Ernst" sort="Althaus, Ernst" uniqKey="Althaus E" first="Ernst" last="Althaus">Ernst Althaus</name>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name>
</region>
<name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name>
</country>
<country name="Allemagne"><region name="Rhénanie-du-Nord-Westphalie"><name sortKey="Elf, Matthias" sort="Elf, Matthias" uniqKey="Elf M" first="Matthias" last="Elf">Matthias Elf</name>
</region>
<name sortKey="Elf, Matthias" sort="Elf, Matthias" uniqKey="Elf M" first="Matthias" last="Elf">Matthias Elf</name>
<name sortKey="Junger, Michael" sort="Junger, Michael" uniqKey="Junger M" first="Michael" last="Jünger">Michael Jünger</name>
<name sortKey="Junger, Michael" sort="Junger, Michael" uniqKey="Junger M" first="Michael" last="Jünger">Michael Jünger</name>
<name sortKey="Kasper, Thomas" sort="Kasper, Thomas" uniqKey="Kasper T" first="Thomas" last="Kasper">Thomas Kasper</name>
<name sortKey="Mehlhorn, Kurt" sort="Mehlhorn, Kurt" uniqKey="Mehlhorn K" first="Kurt" last="Mehlhorn">Kurt Mehlhorn</name>
<name sortKey="Mehlhorn, Kurt" sort="Mehlhorn, Kurt" uniqKey="Mehlhorn K" first="Kurt" last="Mehlhorn">Kurt Mehlhorn</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 008748 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 008748 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:1DADC9ED7085286A646062DB162C7B948D720E64
   |texte=   SCIL — Symbolic Constraints in Integer Linear Programming
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

SCIL — Symbolic Constraints in Integer Linear Programming

SCIL — Symbolic Constraints in Integer Linear Programming

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.